ORBGRAND Is Almost Capacity-Achieving

نویسندگان

چکیده

Decoding via sequentially guessing the error pattern in a received noisy sequence has attention recently, and ORBGRAND been proposed as one such decoding algorithm that is capable of utilizing soft information embedded sequence. An theoretic study conducted for ORBGRAND, it shown achievable rate using independent identically distributed random codebooks almost coincides with channel capacity, an additive white Gaussian noise under antipodal input. For finite-length codes, improved schemes motivated by are attain lower rates than especially high signal-to-noise ratio regime.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rings for which every simple module is almost injective

We introduce the class of “right almost V-rings” which is properly between the classes of right V-rings and right good rings. A ring R is called a right almost V-ring if every simple R-module is almost injective. It is proved that R is a right almost V-ring if and only if for every R-module M, any complement of every simple submodule of M is a direct summand. Moreover, R is a right almost V-rin...

متن کامل

Lecture 30 : Achieving the BSC capacity ( II )

In the last lecture, we started with the description of our BSCp capacity achieving code C∗, which is a concatenated code Cout · Cin, where Cout and Cin satisfy certain properties. In today’s lecture, we will analyze the properties of C∗ and also see how ot get our bounds on Cout and Cin with the desired properties. For notational convenience, we define b′ = b 1−H(P )− ε 2 . Note that b′ is the...

متن کامل

Capacity-Achieving Schemes for Finite-State Channels

Capacity-Achieving Schemes for Finite-State Channels

متن کامل

Achieving fairness in multicasting with almost stateless rate control

Several flow control algorithms have been proposed for attaining maxmin fair rates. All of these strategies use flow specific states at all nodes in the network, and are hence unsuitable for deployment in the current internet. We propose a new approach which attains maxmin fairness in unicast networks while maintaining per flow states at the edge nodes only. Next, we consider multirate, multica...

متن کامل

Regular LDPC Lattices are Capacity-Achieving

The concept and existence of sphere-boundachieving and capacity-achieving lattices has been explained on the AWGN channels by Forney [4]. In this paper we focus on regular LDPC lattices [7]. We introduce and investigate an ensemble of LDPC lattices with known properties. It is shown that these lattices are sphere-bound-achieving and capacityachieving.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2023

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3230782